Probalilistic Logic Programming under Maximum Entropy
نویسندگان
چکیده
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an ef-cient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally, and as a central contribution of this paper, we introduce an eecient technique for approximative probabilistic logic programming under maximum entropy. This technique reduces the original entropy maximization task to solving a modiied and relatively small optimization problem.
منابع مشابه
Probabilistic Logic Programming under Maximum Entropy Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic Logic Programming under Maximum Entropy
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an eecient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally,...
متن کاملCombining probabilistic logic programming with the power of maximum entropy
This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logic programming under maximum entropy. The first one is based on the usual notion of entailment under maximu...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملMaximum Entropy Modeling with Clausal Constraints
We present the learning system Maccent which addresses the novel task of stochastic MAximum ENTropy modeling with Clausal Constraints. Maximum Entropy method is a Bayesian method based on the principle that the target stochastic model should be as uniform as possible, subject to known constraints. Maccent incorporates clausal constraints that are based on the evaluation of Prolog clauses in exa...
متن کاملDynamics of Non-stationary Processes That Follow the Maximum of Continuous Tsallis Entropy
In this paper a non-stationary processes that tend to maximize the Tsallis entropy are considered. Systems with discrete probability distribution for the Tsallis entropy have already been investigated on the basis of the Speed-Gradient principle. The evolution of probability density function and continuous form of the Tsallis entropy are considered. A set of equations describing dynamics of a s...
متن کامل